Proof Theory for Distributed Knowledge
نویسندگان
چکیده
The proof theory of multi-agent epistemic logic extended with operators for distributed knowledge is studied. Distributed knowledge of A within a group G means that A follows from the totality of what the individual members of G know. There are known axiomatizations for epistemic logics with the distributed knowledge operator, but apparently no cut-free proof system for such logics has yet been presented. A Gentzen-style contraction-free sequent calculus system for propositional epistemic logic with operators for distributed knowledge is given, and a cut-elimination theorem for the system is proved. Examples of reasoning about distributed knowledge using the calculus are given.
منابع مشابه
Cluster Computing in Zero Knowledge
Large computations, when amenable to distributed parallel execution, are often executed on computer clusters, for scalability and cost reasons. Such computations are used in many applications, including, to name but a few, machine learning, webgraph mining, and statistical machine translation. Oftentimes, though, the input data is private and only the result of the computation can be published....
متن کاملExtremal Positive Solutions For The Distributed Order Fractional Hybrid Differential Equations
In this article, we prove the existence of extremal positive solution for the distributed order fractional hybrid differential equation$$int_{0}^{1}b(q)D^{q}[frac{x(t)}{f(t,x(t))}]dq=g(t,x(t)),$$using a fixed point theorem in the Banach algebras. This proof is given in two cases of the continuous and discontinuous function $g$, under the generalized Lipschitz and Caratheodory conditions.
متن کاملUsing game theory approach to interpret stable policies for Iran’s oil and gas common resources conflicts with Iraq and Qatar
Oil and gas as the non-renewable resources are considered very valuable for the countries with petroleum economics. These resources are not only diffused equally around the world, but also they are common in some places which their neighbors often come into conflicts. Consequently, it is vital for those countries to manage their resource utilization. Lately, game theory was applied in conflict ...
متن کاملA Logic of Interactive Proofs (Formal Theory of Knowledge Transfer)
We propose a logic of interactive proofs as a framework for an intuitionistic foundation for interactive computation, which we construct via an interactive analog of the Gödel-McKinsey-Tarski-Artëmov definition of Intuitionistic Logic as embedded into a classical modal logic of proofs, and of the Curry-Howard isomorphism between intuitionistic proofs and typed programs. Our interactive proofs e...
متن کاملNeuron Mathematical Model Representation of Neural Tensor Network for RDF Knowledge Base Completion
In this paper, a state-of-the-art neuron mathematical model of neural tensor network (NTN) is proposed to RDF knowledge base completion problem. One of the difficulties with the parameter of the network is that representation of its neuron mathematical model is not possible. For this reason, a new representation of this network is suggested that solves this difficulty. In the representation, th...
متن کامل